End User Controlled Visualizationof Large Graphs
نویسندگان
چکیده
Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately, graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach works well with smaller graphs, but often cannot produce readable layouts for large graphs. This paper presents a novel methodology for viewing large graphs, which allows, the user to interactively navigate through large graphs, learning about them in appropriately small and concise pieces. The motivation of this approach is that large graphs contain too much information to be conveyed by a single canonical layout. For a user to be able to understand the data encoded in the graph, he or she must be able to carve up the graph into manageable pieces and then create custom layouts that match his or her current interests. The presented methodology contains three new concepts for supporting interactive graph layout: interactive decomposition of large graphs, end-user speciied layout algorithms, and parameterized layout algorithms.
منابع مشابه
Automatic Graph Clustering
We present a technique and a program for the automatic clustering of graphs. The technique is based on several heuristics, which allows for an eecient implementation on a personal computer. Our approach is capable of clustering graphs with > 3000 vertices eeciently. The demonstration shows an interactive user environment that supports both automatic and user-controlled clustering. As an applica...
متن کاملNScale: Neighborhood-centric Analytics on Large Graphs
There is an increasing interest in executing rich and complex analysis tasks over large-scale graphs, many of which require processing and reasoning about a large number of multi-hop neighborhoods or subgraphs in the graph. Examples of such tasks include ego network analysis, motif counting in biological networks, finding social circles, personalized recommendations, link prediction, anomaly de...
متن کاملFinding Community Base on Web Graph Clustering
Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...
متن کاملGARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs
Unraveling “interesting” subgraphs corresponding to disease/crime hotspots or characterizing habitation shift patterns is an important graph mining task. With the availability and growth of large-scale real-world graphs, mining for such subgraphs has become the need of the hour for graph miners as well as non-technical end-users. In this demo, we present GARUDA, a system capable of mining large...
متن کاملRECOG: Recognition and Exploration of Content Graphs
We present RECOG (Recognition and Exploration of COntent Graphs), a system for visualizing and interacting with speaker content graphs constructed from large data sets of speech recordings. In a speaker content graph, nodes represent speech signals and edges represent speaker similarity. First, we describe a layout algorithm that optimizes content graphs for ease of navigability. We then presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007